Double variable neighbourhood search with smoothing for the molecular distance geometry problem
نویسندگان
چکیده
منابع مشابه
Double variable neighbourhood search with smoothing for the molecular distance geometry problem
We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem, and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective fun...
متن کاملDouble VNS for the Molecular Distance Geometry Problem
In this paper we propose a VNS-based algorithm for the solution of the Molecular Distance Geometry Problem. First, we use VNS to solve a smoothed version of the problem to identify the most promising zone in the solution space. We then use VNS again to solve the original problem restricted to the promising zone. This algorithm often manages to find a solutions having higher accuracy than other ...
متن کاملVariable neighbourhood search for the minimum labelling Steiner tree problem
We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem. Given an undirected labelled connected graph, the aim is to find a spanning tree covering a given subset of nodes of the graph, whose edges have the smallest number of distinct labels. Such a model may be used to repr...
متن کاملParallel Variable Neighbourhood Search for the Car Sequencing Problem
Variable Neighborhood Search (VNS) is a relatively new metaheuristic for solving hard combinatorial optimisation problems. One such optimisation problem is the Car Sequencing Problem (CarSP), where a sequence of cars along the assembly line with minimum production costs has to be found. Although VNS is a successful metaheuristic, it takes a long time until a suitable solution is found for real-...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2007
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-007-9218-1